Constructibility and Rosserizability of the Proofs of Boolos and Chaitin for Godel's Incompleteness Theorem
نویسندگان
چکیده
The proofs of Chaitin and Boolos for Gödel’s Incompleteness Theorem are studied from the perspectives of constructibility and Rosserizability. By Rosserization of a proof we mean that the independence of the true but unprovable sentence can be shown by assuming only the (simple) consistency of the theory. It is known that Gödel’s own proof for his incompleteness theorem is not Rosserizable, and we show that neither are Kleene’s or Boolos’ proofs. However, we prove a Rosserized version of Chaitin’s (incompleteness) theorem. The proofs of Gödel, Rosser and Kleene are constructive in the sense that they explicitly construct, by algorithmic ways, the independent sentence(s) from the theory. We show that the proofs of Chaitin and Boolos are not constructive, and they prove only the mere existence of the independent sentences.
منابع مشابه
A Fundamental Flaw in Incompleteness Proofs by Gregory Chaitin
There are several similar proofs published by Chaitin involving the concept of information-theoretic complexity, and Chaitin claims that these are proof of the incompleteness of formal systems. An elementary analysis of these proofs demonstrates that the proofs are not in fact proofs of incompleteness.
متن کاملGödel incompleteness revisited
We investigate the frontline of Gödel’s incompleteness theorems’ proofs and the links with computability. The Gödel incompleteness phenomenon Gödel’s incompleteness theorems [Göd31, SFKM+86] are milestones in the subject of mathematical logic. Apart from Gödel’s original syntactical proof, many other proofs have been presented. Kreisel’s proof [Kre68] was the first with a model-theoretical flav...
متن کاملA Fundamental Flaw in an Incompleteness Proof by George Boolos
This paper addresses a proof of incompleteness published by George Boolos. An analysis of this proofs demonstrates that there is an elementary error in the proof; the proof relies on the unproven assumption that the formal system can selfreference its own formulas.
متن کاملDiagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کاملBoolos-style proofs of limitative theorems
In his famous paper announcing the incompleteness theorem, Gödel remarked that, though his argument is analogous to the Richard and the Liar paradoxes, “Any epistemological antinomy could be used for a similar proof of the existence of undecidable propositions.” ([7] Note 14). It is interesting that, despite the fact that the soundness of arguments like Gödel’s one built on self–reference (or d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1612.02549 شماره
صفحات -
تاریخ انتشار 2016